On sequences of positive integers containing no p terms in arithmetic progression
نویسندگان
چکیده
We use topological ideas to show that, assuming the conjecture of Erdös [4] on subsets of positive integers having no p terms in arithmetic progression (A. P.), there must exist a subset Mp of positive integers with no p terms in A. P. with the property that among all such subsets, Mp maximizes the sum of the reciprocals of its elements.
منابع مشابه
The Sum of the Reciprocals of a Set of Integers with No Arithmetic Progression of Á: Terms1
It is shown that for each integer k > 3, there exists a set Sk of positive integers containing no arithmetic progression of k terms, such that 2„6Si \/n > (1 e)k log A:, with a finite number of exceptional k for each real e > 0. This result is shown to be superior to that attainable with other sets in the literature, in particular Rankin's sets &(k), which have the highest known asymptotic dens...
متن کاملOn rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملBehrend's Theorem for Sequences Containing No k-Element Arithmetic Progression of a Certain Type
Let k and n be positive integers, and let d(n;k) be the maximum density in f0;1;2 : : : ;kn 1g of a set containing no arithmetic progression of k terms with first term a = ∑aik and common difference d = ∑εik, where 0 ai k 1, εi = 0 or 1, and εi = 1 ) ai = 0. Setting βk = limn!∞ d(n;k), we show that limk!∞ βk is either 0 or 1. Throughout, we shall use the notation [a;b) = fa;a+ 1;a+ 2; : : : ;b ...
متن کاملSome Curious Sequences Constructed with the Greedy Algorithm
Given a xed positive integer k, deene a sequence S(k) of positive integers 0 = a 0 < a 1 < : : : by the conditions: (i) a 1 = k (ii) having chosen a 0 , a 1 ; : : : ; a n (n 1), let a n+1 be the least integer such that a n+1 > a n and such that the sequence a 1 , a 1 ; : : : ; a n ; a n+1 contains no three terms (not necessarily consecutive) in an arithmetic progression. One might hope that the...
متن کاملNovel structures in Stanley sequences
Given a set of integers with no three in arithmetic progression, we construct a Stanley sequence by adding integers greedily so that no arithmetic progression is formed. This paper offers two main contributions to the theory of Stanley sequences. First, we characterize well-structured Stanley sequences as solutions to constraints in modular arithmetic, defining the modular Stanley sequences. Se...
متن کامل